A skein-like multiplication algorithm for unipotent Hecke algebras

نویسنده

  • Nathaniel Thiem
چکیده

LetG be a finite group of Lie type (e.g. GLn(Fq)) and U a maximal unipotent subgroup of G. If ψ is a linear character of U , then the unipotent Hecke algebra isHψ = EndCG(Ind G U (ψ)). Unipotent Hecke algebras have a natural basis coming from double cosets of U in G. This paper describes relations for reducing products of basis elements, and gives a detailed description of the implications in the case G = GLn(Fq).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HOMFLYPT Skein module of singular links

This paper is a presentation, where we compute the HOMFLYPT Skein module of singular links in the 3-sphere. This calculation is based on some results previously proved by Rabenda and the author on Markov traces on singular Hecke algebras, as well as on classical techniques that allow to pass from the framework of Markov traces on Hecke algebras to the framework of HOMFLYPT Skein modules. Some o...

متن کامل

ON UNITARY UNIPOTENT REPRESENTATIONS OF p-ADIC GROUPS AND AFFINE HECKE ALGEBRAS WITH UNEQUAL PARAMETERS

We determine the unitary dual of the geometric graded Hecke algebras with unequal parameters which appear in Lusztig’s classification of unipotent representations for exceptional p-adic groups. The largest such algebra is of type F4. Via the Barbasch-Moy correspondence of unitarity applied to this setting, this is equivalent to the identification of the corresponding unitary unipotent represent...

متن کامل

Towards Spetses I

We present a formalization using data uniquely de ned at the level of the Weyl group of the construction and combinatorial properties of unipotent character shea ves and unipotent characters for reductive algebraic groups over an algebraic closure of a nite eld This formalization extends to the case where the Weyl group is re placed by a complex re ection group and in many cases we get families...

متن کامل

Generalized Green Functions and Unipotent Classes for Finite Reductive Groups, I

The algorithm of computing generalized Green functions of a reductive group G contains some unknown scalars occurring from the Fq-structure of irreducible local systems on unipotent classes of G. In this paper, we determine such scalars in the case where G = SLn with Frobenius map F of split type or non-split type. In the case where F is of non-split type, we use the theory of graded Hecke alge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004